Home > Search Results: keywords:"scheduling|timetabling|approximation algorithms"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Algorithms for timetabling in sports
 Koštejn, Vít ; Sgall, Jiří (advisor) ; Vu, Tung Anh (referee)
This bachelor thesis studies the timetabling problem of the creation of startlists for orienteering events. We focus both on theoretical and practical results. In the theo- retical part, the problem is translated to the scheduling terminology and then analyzed together with its special cases. We are mostly interested in the approximation algorithms and their ratios. In the practical part, we study multiple methods based on the pre- viously analyzed approximation algorithms and constraint programming for generating such startlists. Subsequently, these methods are tested on real data from previous events and compared with the startlists made by humans. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English